factorization problem

См. также в других словарях:

• Factorization — This article is about the mathematical concept. For other uses, see Factor and Integer factorization. A visual illustration of the polynomial x2 + cx + d = (x + a)(x + b) where… …   Wikipedia

• Factorization lemma — In measure theory, the factorization lemma allows us to express a function f with another function T if f is measurable with respect T . An application of this is regression analysis.TheoremLet T:Omega ightarrowOmega be a function of a set Omega… …   Wikipedia

• Integer factorization — In number theory, integer factorization is the way of breaking down a composite number into smaller non trivial divisors, which when multiplied together equal the original integer.When the numbers are very large, no efficient integer… …   Wikipedia

• P versus NP problem — Unsolved problems in computer science Is P = NP ? …   Wikipedia

• Non-negative matrix factorization — NMF redirects here. For the bridge convention, see new minor forcing. Non negative matrix factorization (NMF) is a group of algorithms in multivariate analysis and linear algebra where a matrix, , is factorized into (usually) two matrices, and… …   Wikipedia

• Function problem — In computational complexity theory, a function problem is a problem other than a decision problem, that is, a problem requiring a more complex answer than just YES or NO.Notable examples include the travelling salesman problem, which asks for the …   Wikipedia

• Polynomial factorization — In mathematics and computer algebra, polynomial factorization typically refers to factoring a polynomial into irreducible polynomials over a given field. Formulation of the questionOther factorizations, such as square free factorization exist,… …   Wikipedia

• Higher residuosity problem — In cryptography most public key cryptosystems are founded on problems that are believed to be intractable. The higher residuosity problem is one such problem. This problem is easier to solve than integer factorization, so the assumption that this …   Wikipedia

• RSA problem — In cryptography, the RSA problem is the task of finding e th roots modulo a composite number N whose factors are not known. In other words, the problem is to perform the RSA private key operation given only the public key. A fast means of solving …   Wikipedia

• Hilbert's twenty-first problem — For Riemann Hilbert factorization problems on the complex plane see Riemann Hilbert. The twenty first problem of the 23 Hilbert problems, from the celebrated list put forth in 1900 by David Hilbert, was phrased like this (English translation from …   Wikipedia

• Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… …   Wikipedia